Rolf Niedermeier
60 publications
12 venues
H Index 14
Affiliation
Technical University of Berlin, Department of Mathematics, GermanyLinks
DBLPGoogle Scholar
ORCID- http://www.akt.tu-berlin.de/menue/team/niedermeier-rolf/
- https://scholar.google.com/citations?user=K2BY6JcAAAAJ
- https://dl.acm.org/profile/81100191636
- https://zbmath.org/authors/?q=ai:niedermeier.rolf
- https://mathgenealogy.org/id.php?id=128069
- https://en.wikipedia.org/wiki/Rolf_Niedermeier
- https://www.wikidata.org/entity/Q90410629
- https://id.loc.gov/authorities/names/no2006063758
- https://d-nb.info/gnd/105937899X
- https://ieeexplore.ieee.org/author/37860541800
- https://mathscinet.ams.org/mathscinet/MRAuthorID/352823
| Name | Venue | Year | citations |
|---|---|---|---|
Parameterized Algorithms for Colored Clustering.
|
AAAI | 2023 | 0 |
| Fair Short Paths in Vertex-Colored Graphs.
|
AAAI | 2023 | 0 |
| High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming.
|
ECAI | 2023 | 0 |
| Improving Resource Allocations by Sharing in Pairs.
|
JAIR | 2023 | 0 |
| A refined complexity analysis of fair districting over graphs.
|
Autonomous Agents and Multi-Agent Systems | 2023 | 0 |
| Interference-free walks in time: temporally disjoint paths.
|
Autonomous Agents and Multi-Agent Systems | 2023 | 0 |
| Understanding Distance Measures Among Elections.
|
IJCAI | 2022 | 2 |
| On Improving Resource Allocations by Sharing.
|
AAAI | 2022 | 0 |
| Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets.
|
AAAI | 2022 | 0 |
| Modification-Fair Cluster Editing.
|
AAAI | 2022 | 0 |
| A Refined Complexity Analysis of Fair Districting over Graphs.
|
AAMAS | 2022 | 0 |
| Equilibria in Schelling Games: Computational Hardness and Robustness.
|
AAMAS | 2022 | 0 |
| The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality.
|
JAIR | 2022 | 0 |
| Envy-free allocations respecting social networks.
|
Artificial Intelligence | 2022 | 0 |
| Interference-free Walks in Time: Temporally Disjoint Paths.
|
IJCAI | 2021 | 9 |
| Two Influence Maximization Games on Graphs Made Temporal.
|
IJCAI | 2021 | 2 |
| A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem.
|
AAAI | 2021 | 1 |
| Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions.
|
AAMAS | 2021 | 13 |
| Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments.
|
IJCAI | 2021 | 14 |
| High-Multiplicity Fair Allocation Made More Practical.
|
AAMAS | 2021 | 3 |
| Putting a Compass on the Map of Elections.
|
IJCAI | 2021 | 13 |
| On coalitional manipulation for multiwinner elections: shortlisting.
|
Autonomous Agents and Multi-Agent Systems | 2021 | 0 |
| Equitable Scheduling on a Single Machine.
|
AAAI | 2021 | 0 |
| Bribery and Control in Stable Marriage.
|
JAIR | 2021 | 0 |
| Robustness among multiwinner voting rules.
|
Artificial Intelligence | 2021 | 0 |
| Multidimensional Stable Roommates with Master List.
|
WINE | 2020 | 12 |
| Parameterized Algorithms for Finding a Collective Set of Items.
|
AAAI | 2020 | 10 |
| Electing Successive Committees: Complexity and Algorithms.
|
AAAI | 2020 | 6 |
| Algorithmic Aspects of Temporal Betweenness.
|
KDD | 2020 | 20 |
| Adapting Stable Matchings to Evolving Preferences.
|
AAAI | 2020 | 0 |
| Stable roommates with narcissistic, single-peaked, and single-crossing preferences.
|
Autonomous Agents and Multi-Agent Systems | 2020 | 0 |
| An Experimental View on Committees Providing Justified Representation.
|
IJCAI | 2019 | 18 |
| Exact mean computation in dynamic time warping spaces.
|
DMKD | 2019 | 0 |
| Envy-Free Allocations Respecting Social Networks.
|
AAMAS | 2018 | 34 |
| Exact Mean Computation in Dynamic Time Warping Spaces.
|
SDM | 2018 | 0 |
| On Coalitional Manipulation for Multiwinner Elections: Shortlisting.
|
IJCAI | 2017 | 11 |
| Teams in Online Scheduling Polls: Game-Theoretic Aspects.
|
AAAI | 2017 | 0 |
| Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences.
|
ADT | 2017 | 0 |
| Elections with Few Voters: Candidate Control Can Be Easy.
|
JAIR | 2017 | 0 |
| Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.
|
JAIR | 2017 | 0 |
| Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.
|
IJCAI | 2016 | 27 |
| Complexity of Shift Bribery in Committee Elections.
|
AAAI | 2016 | 38 |
| h-Index Manipulation by Undoing Merges.
|
ECAI | 2016 | 0 |
| Large-Scale Election Campaigns: Combinatorial Shift Bribery.
|
JAIR | 2016 | 0 |
| H-index manipulation by merging articles: Models, theory, and experiments.
|
Artificial Intelligence | 2016 | 0 |
| Elections with Few Candidates: Prices, Weights, and Covering Problems.
|
ADT | 2015 | 33 |
| H-Index Manipulation by Merging Articles: Models, Theory, and Experiments.
|
IJCAI | 2015 | 20 |
| Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.
|
IJCAI | 2015 | 12 |
| Large-Scale Election Campaigns: Combinatorial Shift Bribery.
|
AAMAS | 2015 | 40 |
| Elections with Few Voters: Candidate Control Can Be Easy.
|
AAAI | 2015 | 0 |
| Prices Matter for the Parameterized Complexity of Shift Bribery.
|
AAAI | 2014 | 58 |
| Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation.
|
Autonomous Agents and Multi-Agent Systems | 2014 | 51 |
| The effect of homogeneity on the computational complexity of combinatorial data anonymization.
|
DMKD | 2014 | 0 |
| A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
|
JAIR | 2014 | 0 |
| How to Put through Your Agenda in Collective Binary Decisions.
|
ADT | 2013 | 8 |
| A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
|
AAAI | 2012 | 37 |
| Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard.
|
IJCAI | 2011 | 93 |
| Exact Algorithms and Experiments for Hierarchical Tree Clustering.
|
AAAI | 2010 | 9 |
| How similarity helps to efficiently compute Kemeny rankings.
|
AAMAS | 2009 | 21 |
| A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes.
|
IJCAI | 2009 | 71 |